<HTML><HEAD><TITLE>lower_bound_lookup(+Tree, ++SearchKey, ?Key, ?Value)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(m_tree234)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>lower_bound_lookup(+Tree, ++SearchKey, ?Key, ?Value)</H1>
Search a tree for the smallest key no smaller than SearchKey.
<DL>
<DT><EM>Tree</EM></DT>
<DD>A 2-3-4 tree
</DD>
<DT><EM>SearchKey</EM></DT>
<DD>A key to search for
</DD>
<DT><EM>Key</EM></DT>
<DD>The key found
</DD>
<DT><EM>Value</EM></DT>
<DD>The value corresponding to Key
</DD>
</DL>
<H2>Description</H2>
	<P>
	This predicate searches the tree Tree for the entry with the
	smallest key which is no smaller than SearchKey.  If such a key is
	found, then it attempts to unify it with Key and the corresponding
	value with Value.  If such a key is not found, then it aborts with
	a runtime error.
	</P>
	<P>
	This predicate should only be called with trees created by other
	predicates from the tree234 module.
	</P>
	
<H3>Fail Conditions</H3>
Fails if Key and Value do not unify with the key and value found.
<H3>Resatisfiable</H3>
no
<H2>See Also</H2>
<A HREF="../../lib_public/m_tree234/lower_bound_search-4.html">lower_bound_search / 4</A>, <A HREF="../../lib_public/m_tree234/upper_bound_search-4.html">upper_bound_search / 4</A>, <A HREF="../../lib_public/m_tree234/upper_bound_lookup-4.html">upper_bound_lookup / 4</A>
</BODY></HTML>
